#pragma comment(linker, "/STACK:10000000")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <cstdio>
#include <cassert>
#include <string>
#include <cstring>
#define ldb long double
#define ll long long
#define fi first
#define se second
#define fill(a, c) memset(a, c, sizeof(a))
#define sqr(a) ((a) * (a))
#define nextLine() {int c = 0; while((c = getchar()) != 10 && c != EOF);}
#define getBit(mask, k) (((mask) / pw[k]) % pw[1])
#define setBit(mask, k, l) (((mask) / pw[k + 1] * pw[1] + (l)) * pw[k] + ((mask) % pw[k]))
#define debug(a) cerr << #a << " = " << a << " ";
#define debugl(a) cerr << #a << " = " << a << "\n";
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define ff first
#define ss second 
const ldb LDINF = 9128739847123.00;
const ldb eps = 1e-9;
const int inf = 1 << 28;
const ldb pi = fabsl(atan2l(0.0, -1.0));
using namespace std;

int n, m;
void load()
{
	cin >> n >> m;
}
int f[100010];
const int mod = 1000000007;

void solve()
{
	int sum = m % mod;
	for (int i = 1; i <= m; i++)
		f[i] = 1;
	for (int i = m + 1; i <= n; i++)
	{
		f[i] = sum;
		sum -= f[i - m];
		if (sum < 0) sum += mod;
		if (sum >= mod) sum -= mod;
		sum += f[i];
		if (sum >= mod) sum -= mod;
	}
	int res = f[n];
	for (int i = 1; i < m; i++)
	{
		res += ((ll)f[n - i] * ((ll)m - i)) % (ll)mod;
		if (res >= mod) res -= mod;
	}
	for (int i = 1; i <= m; i++)
	{
		res = ((ll)res * (ll)i) % (ll)mod;
	}
	printf ("%d\n", res);
}

#define file "chain"
int main()
{
	#ifndef ONLINE_JUDGE
		freopen(file".in", "rt", stdin);
		freopen(file".out", "wt", stdout);
	#endif
	int T;
	cin >> T;
	for (int i = 0; i < T; i++)
	{
		load();
		solve();
	}
	return 0;
}
